Seven new champion linear codes

نویسندگان

  • Gavin Brown
  • Alexander M. Kasprzyk
چکیده

We exhibit seven linear codes exceeding the current best known minimum distance d for their dimension k and block length n. Each code is defined over F8, and their invariants [n, k, d] are given by [49, 13, 27], [49, 14, 26], [49, 16, 24], [49, 17, 23], [49, 19, 21], [49, 25, 16] and [49, 26, 15]. Our method includes an exhaustive search of all monomial evaluation codes generated by points in the [0, 5]× [0, 5] lattice square.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Consumers or Citizens? Whose Voice Will Healthwatch Represent and Will It Matter?; Comment on “Challenges Facing Healthwatch, a New Consumer Champion in England”

Efforts to achieve effective and meaningful patient and public involvement (PPI) in healthcare have existed for nearly a century, albeit with limited success. This brief commentary discusses a recent paper by Carter and Martin exploring the “Challenges Facing Healthwatch, a New Consumer Champion in England,” and places these challenges in the context of the broader struggle to give a voice to h...

متن کامل

Some new quasi - twisted ternary linear codes ∗

Let [n, k, d]q code be a linear code of length n, dimension k and minimum Hamming distance d over GF (q). One of the basic and most important problems in coding theory is to construct codes with best possible minimum distances. In this paper seven quasi-twisted ternary linear codes are constructed. These codes are new and improve the best known lower bounds on the minimum distance in [6]. 2010 ...

متن کامل

Optimal Linear Codes Over GF(7) and GF(11) with Dimension 3

Let $n_q(k,d)$ denote the smallest value of $n$ for which there exists a linear $[n,k,d]$-code over the Galois field $GF(q)$. An $[n,k,d]$-code whose length is equal to $n_q(k,d)$ is called {em optimal}. In this paper we present some matrix generators for the family of optimal $[n,3,d]$ codes over $GF(7)$ and $GF(11)$. Most of our given codes in $GF(7)$ are non-isomorphic with the codes pre...

متن کامل

Challenges Facing Healthwatch, a New Consumer Champion in England

This article engages with debates about the conceptualisation and practical challenges of patient and public involvement (PPI) in health and social care services. Policy in this area in England has shifted numerous times but increasingly a consumerist discourse seems to override more democratic ideas concerning the relationship between citizens and public services. Recent policy change in Engla...

متن کامل

Constructions of maximum distance separable symbol-pair codes using cyclic and constacyclic codes

Symbol-pair code is a new coding framework which is proposed to correct errors in the symbolpair read channel. In particular, maximum distance separable (MDS) symbol-pair codes are a kind of symbol-pair codes with the best possible error-correction capability. Employing cyclic and constacyclic codes, we construct three new classes of MDS symbol-pair codes with minimum pairdistance five or six. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1212.5197  شماره 

صفحات  -

تاریخ انتشار 2012